Incremental phylogenetics by repeated insertions: An evolutionary tree algorithm
نویسندگان
چکیده
We introduce the idea of constructing hypothetical evolutionary trees using an incremental algorithm that inserts species one-by-one into the current evolutionary tree. The method of incremental phylogenetics by repeated insertions lead to an algorithm that can be used on DNA, RNA and amino acid sequences. According to experimental results on both synthetic and biological data, the new algorithm generates more accurate evolutionary trees than the UPGMA and the Neighbor Joining algorithms. Keywords—Amino acid, DNA, evolution, phylogenetic tree.
منابع مشابه
An Incremental Phylogenetic Tree Algorithm Based on Repeated Insertions of Species
In this paper, we introduce a new phylogenetic tree algorithm that generates phylogenetic trees by repeatedly inserting species one-by-one. The incremental phylogenetic tree algorithm can work on proteins or DNA sequences. Computer experiments show that the new algorithm is better than the commonly used UPGMA and Neighbor Joining algorithms. Keywords—Data structure, Distance matrix, Phylogeneti...
متن کاملAn Experimental Study of Dynamic Dominators
Motivated by recent applications of dominator computations, we consider the problem of dynamically maintaining the dominators of flow graphs through a sequence of insertions and deletions of edges. Our main theoretical contribution is a simple incremental algorithm that maintains the dominator tree of a flow graph with n vertices through a sequence of k edge insertions in O(mmin{n, k}+ kn) time...
متن کاملEfficient and consistent inference of ancestral sequences in an evolutionary model with insertions and deletions under dense taxon sampling
In evolutionary biology, the speciation history of living organisms is represented graphically by a phylogeny, that is, a rooted tree whose leaves correspond to current species and branchings indicate past speciation events. Phylogenies are commonly estimated from molecular sequences, such as DNA sequences, collected from the species of interest. At a high level, the idea behind this inference ...
متن کاملProbabilistic Phylogenetic Inference with Insertions and Deletions
A fundamental task in sequence analysis is to calculate the probability of a multiple alignment given a phylogenetic tree relating the sequences and an evolutionary model describing how sequences change over time. However, the most widely used phylogenetic models only account for residue substitution events. We describe a probabilistic model of a multiple sequence alignment that accounts for in...
متن کاملPhylogenetic Reconstruction with Insertions and Deletions
We study phylogenetic reconstruction of evolutionary trees, undergoing three possible types of mutations: substitutions, insertions, and deletions. We give the first efficient algorithm for this problem which needs sequences of only poly-logarithmic length. The best previously known result of Daskalakis and Roch [DR10] showed how to do phylogenetic reconstruction using sequences of polynomial l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2018